Fast computation of magnetostatic fields by nonuniform fast Fourier transforms
نویسندگان
چکیده
منابع مشابه
Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms
The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN , whereas the geometrically more versatile finite element methods (FEM) are bounded to N in the best case. We report the implementation of a Non-uniform Fast Fourier Transform algorithm which brings a N lo...
متن کاملFast Computation of Partial Fourier Transforms
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal compl...
متن کاملIterative Tomographic Image Reconstruction Using Nonuniform Fast Fourier Transforms
Fourier-based reprojection methods have the potential to reduce the computation time in iterative tomographic image reconstruction. Interpolation errors are a limitation of Fourier-based reprojection methods. We apply a min-max interpolation method for the nonuniform fast Fourier transform (NUFFT) to minimize the interpolation errors. Numerical results show that the min-max NUFFT approach provi...
متن کاملNonuniform fast Fourier transforms using min-max interpolation
The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) of finitelength signals over a set of uniformly-spaced frequency locations. However, in many applications, one requires nonuniform sampling in the frequency domain, i.e., a nonuniform FT . Several papers have described fast approximations for the nonuniform FT based on interpolating an oversample...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Physics Letters
سال: 2008
ISSN: 0003-6951,1077-3118
DOI: 10.1063/1.2995850